package com.leet.everyday;

public class Fib {
    public int fib(int n) {
        int l = 1000000007;
        int[] dp = new int[n+1];
        if(n==0) return 0;
        if(n==1) return 1;
        dp[0]=0;
        dp[1]=1;
        dp[2]=1;
        for(int i = 2;i <= n;i++){
            dp[i] = (dp[i-1]+dp[i-2])%l;
        }
        return dp[n-1];
    }
}